Quasi-deterministic 5' -> 3' Watson-Crick Automata

نویسندگان

چکیده

Watson-Crick (WK) finite automata are working on a tape, that is, DNA molecule. A double stranded molecule contains two strands, each having 5' and 3' end, these strands together form the with following properties. The have same length, their to directions opposite, in position, nucleotides complement of other (by complementary relation). Consequently, WK reading heads, one for strand. In traditional both heads read whole input physical direction, but 5'->3' start from extremes opposite direction. sensing automata, process is finished when meet, model capable accept class linear context-free languages. Deterministic variants weaker, named 2detLIN, proper subclass languages accepted by them. Recently, another specific variants, state-deterministic investigated which graph automaton has special property node graph, all out edges (if any) go sole node, i.e., state there (at most) can be reached direct transition. It was shown this concept somewhat orthogonal usual determinism case automata. paper new concept, quasi-determinism investigated, configuration computation it not yet), next uniquely determined although may be, various transitions enabled at time. We show common generalisation state-determinism, quasi-deterministic superclass mentioned classes. There restrictions e.g., stateless or 1-limited variants. also prove some hierarchy results among language classes subclasses already known

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted deterministic Watson-Crick automata

In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic WatsonCrick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is restricted to a language L. We examine the computational power of the restricted model with respect to L being in different language classes such as regular, u...

متن کامل

5′→ 3′ Sensing Watson-Crick Finite Automata

DNA computers provide new paradigms of computing (Păun et al., 1998). They appeared at the end of the last century. In contrast, the theory of finite automata is well developed and intensively used in both theory and practice. The Watson-Crick automata, introduced in (Freund et al., 1997), relate to both fields. They are important in the field of (DNA) computing and have important relation to f...

متن کامل

Stateless multicounter 5′ → 3′ Watson-Crick automata

The model we consider are stateless counter machines which mix the features of one-head counter machines and special two-head Watson-Crick automata (WK-automata). These biologically motivated machines have reading heads that read the input starting from the two extremes. The reading process is finished when the heads meet. The machine is realtime or non-realtime depending on whether the heads a...

متن کامل

Deterministic parallel communicating Watson-Crick automata systems

In this paper, we have introduced the deterministic variant of parallel communicating Watson-Crick automata systems. We show that similar to the non-deterministic version, the deterministic version can also recognise some non-regular uniletter languages. We further establish that strongly deterministic Watson-Crick automata systems and deterministic Watson-Crick automata system are incomparable...

متن کامل

Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages

We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our Watson-Crick counter machines are biologically motivated. They have two heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads, i.e., every letter of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2022

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.367.11